Mixed Volume Computation, A Revisit
نویسندگان
چکیده
The superiority of the dynamic enumeration of all mixed cells suggested by T. Mizutani et al. for the mixed volume computation over the existing methods was reported in [15]. In this article, we embed the idea of dynamic enumeration into our original algorithm for the mixed volume computation presented in [7], and a new algorithm is developed by employing both primal and dual simplex algorithms. Illustrated by the numerical results, our new algorithm improves the speed of the code in [15] by a substantial margin.
منابع مشابه
The Principle of Relativity: From Ungar’s Gyrolanguage for Physics to Weaving Computation in Mathematics
This paper extends the scope of algebraic computation based on a non standard $times$ to the more basic case of a non standard $+$, where standard means associative and commutative. Two physically meaningful examples of a non standard $+$ are provided by the observation of motion in Special Relativity, from either outside (3D) or inside (2D or more), We revisit the ``gyro''-theory ...
متن کاملSome new Techniques for Explicit Mixed Volume Computation
We give some new technical tools which simplify mixed volume computation for larger polynomial systems and allow the computation of mixed volume bounds for polynomial systems of arbitrary dimension arising in various applications as seen in [14].
متن کاملMixed Volume Computation in Parallel
Efficient algorithms for computing mixed volumes, via the computation of mixed cells, have been implemented in DEMiCs [18] and MixedVol-2.0 [13]. While the approaches in those two packages are somewhat different, they follow the same theme and are both highly serial. To fit the need for the parallel computing, a reformulation of the algorithms is inevitable. This article proposes a reformulatio...
متن کاملA Comparative Revisitation of Some Program Transformation Techniques
We revisit the main techniques of program transformation which are used in partial evaluation mixed computation supercompi lation generalized partial computation rule based program derivation program specialization compiling control and the like We present a methodology which underlines these techniques as a common pattern of reasoning and explains the various correspondences which can be estab...
متن کاملRandom Walks and Mixed Volumes of Hypersimplices
Below is a method for relating a mixed volume computation for polytopes sharing many facet directions to a symmetric random walk. The example of permutahedra and particularly hypersimplices is expanded upon.
متن کامل